Incentive Design in a Distributed Problem with Strategic Agents

نویسندگان

  • Donya Ghavidel
  • Pratyush Chakraborty
  • Enrique Baeyens
  • Vijay Gupta
  • Pramod P. Khargonekar
چکیده

In this paper, we consider a general distributed system with multiple agents who select and then implement actions in the system. The system has an operator with a centralized objective. The agents, on the other hand, are selfinterested and strategic in the sense that each agent optimizes its own individual objective. The operator aims to mitigate this misalignment by designing an incentive scheme for the agents. The problem is difficult due to the cost functions of the agents being coupled, the objective of the operator not being social welfare, and the operator having no direct control over actions being implemented by the agents. This problem has been studied in many fields, particularly in mechanism design and cost allocation. However, mechanism design typically assumes that the operator has knowledge of the cost functions of the agents and the actions being implemented by the operator. On the other hand, cost allocation classically assumes that agents do not anticipate the effect of their actions on the incentive that they obtain. We remove these assumptions and present an incentive rule for this setup by bridging the gap between mechanism design and classical cost allocation. We analyze whether the proposed design satisfies various desirable properties such as social optimality, budget balance, participation constraint, and so on. We also analyze which of these properties can be satisfied if the assumptions of cost functions of the agents being private and the agents being anticipatory are relaxed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Dynamic Incentive Mechanism for Security in Networks of Interdependent Agents

We study a dynamic mechanism design problem for a network of interdependent strategic agents with coupled dynamics. In contrast to the existing results for static settings, we present a dynamic mechanism that is incentive compatible, individually rational, budget balanced, and social welfare maximizing. We utilize the correlation among agents’ states over time, and determine a set of inference ...

متن کامل

Supply chain network design problem for a new market opportunity in an agile manufacturing system

The characteristics of today's competitive environment, such as the speed with which products are designed, manufactured, and distributed, and the need for higher responsiveness and lower operational cost, are forcing companies to search for innovative ways to do business. The concept of agile manufacturing has been proposed in response to these challenges for companies. This ...

متن کامل

Mechanisms for a Spatially Distributed Market1

We consider the problem of a spatially distributed market with strategic agents. In this problem a single good is traded in a set of independent markets, where shipment between markets is possible but incurs a cost. The problem has previously been studied in the non-strategic case, in which it can be analyzed and solved as a min-cost-flow problem. We consider the case where buyers and sellers a...

متن کامل

Information Sharing in Networks of Strategic Agents

To ensure that social networks (e.g. opinion consensus, cooperative estimation, distributed learning and adaptation etc.) proliferate and efficiently operate, the participating agents need to collaborate with each other by repeatedly sharing information. However, sharing information is often costly for the agents while resulting in no direct immediate benefit for them. Hence, lacking incentives...

متن کامل

Game-Theoretic Foundations for Argumentation

Game theory is becoming central to the design and analysis of computational mechanisms in which multiple entities interact strategically. In particular, the tools of mechanism design are used extensively to engineer incentives for truth-revelation into resource-allocation and preferenceaggregation protocols, as evident in the work on combinatorial auctions and voting. On the other hand, traditi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018